An Individually Variable Mutation-Rate Strategy for Genetic Algorithms
نویسندگان
چکیده
In Neo-Darwinism, mutation can be considered to be unaffected by selection pressure. This is the metaphor generally used by the genetic algorithm for its treatment of the mutation operation, which is usually regarded as a background operator. This metaphor, however, does not take into account the fact that mutation has been shown to be affected by external events. In this paper, we propose a mutationrate strategy that is variable between individuals within a given generation based on the individual’s relative performance for the purpose of function optimization.
منابع مشابه
A Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملA Memtic genetic algorithm for a redundancy allocation problem
Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...
متن کاملTuning Genetic Algorithms for Problems Including Neutral Networks - A More Complex Case: The Terraced NK Problem -
Neutral networks, which occur in fitness landscapes containing neighboring points of equal fitness, have attracted much research interest in recent years. In a recent paper [12], we have shown that, in the case of a very simple test function, the mutation rate of a genetic algorithm is an important factor for improving the speed at which a population moves along a neutral network. Our results a...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملTuning Genetic Algorithms for Problems Including Neutral Networks
Neutral networks, which occur in fitness landscapes containing neighboring points of equal fitness, have attracted much research interest in recent years. In this work, we applied a standard GA and an extended GA with a variable mutation rate strategy to an abstract model of neutral networks in order to investigate the effects of selection pressure and mutation rate on the speed of population m...
متن کامل